Nonclairvoyant scheduling
نویسندگان
چکیده
منابع مشابه
Utilization of nonclairvoyant online schedules
This paper addresses the analysis of nondelay, nonpreemptive, nonclairvoyant online schedules for independent jobs onm identical machines. In our online model, all jobs are submitted over time. We show that the commonly used makespan criterion is not well suited to describe utilization for this online problem. Therefore, we directly address utilization and determine themaximum deviation from th...
متن کاملA Nonclairvoyant Real-Time Scheduler for Ambient Energy Harvesting Sensors
Ambient energy harvesting also known as energy scavenging is the process where energy is obtained from the environment, converted, and stored to power small devices such as wireless sensors. We present a variant of EDF scheduling algorithm called EH-EDF (Energy Harvesting-Earliest Deadline First). Decisions are taken at run-time without having prior knowledge about the future energy production ...
متن کاملEvery Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold
We prove a surprising lower bound for resource augmented nonclairvoyant algorithms for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of average response time. Edmonds in STOC99 shows that the algorithm Equi-partition is a (2+ǫ)-speed Θ( ǫ )-competitive algorithm. We define its speed threshold to be 2 because it is constant competitive whe...
متن کاملMinimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability
We consider the problem of nonclairvoyantly scheduling jobs, which arrive over time and have varying sizes and degrees of parallelizability, with the objective of minimizing the maximum flow. We give essentially tight bounds on the achievable competitiveness. More specifically we show that the competitive ratio of every deterministic nonclairvoyant algorithm is high, namely Ω( √ n). But there i...
متن کاملMulticast Pull Scheduling : When Fairness is
We investigate server scheduling policies to minimize average user perceived latency in pull-based client-server systems (systems where multiple clients request data from a server) where the server answers requests on a multicast/broadcast channel. We rst show that there is no O(1)-competitive algorithm for this problem. We then give a method to convert any nonclairvoyant unicast scheduling alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90151-1